Nonlinear piecewise polynomial approximation and multivariate BV spaces of a Wiener–L. Young type. I.
نویسندگان
چکیده
منابع مشابه
Nonlinear piecewise polynomial approximation beyond Besov spaces
We study nonlinear n-term approximation in Lp(R) (0 < p <∞) from Courant elements or (discontinuous) piecewise polynomials generated by multilevel nested triangulations of R2 which allow arbitrarily sharp angles. To characterize the rate of approximation we introduce and develop three families of smoothness spaces generated by multilevel nested triangulations. We call them B-spaces because they...
متن کاملNonlinear piecewise polynomial approximation: Theory and Algorithms
Nonlinear piecewise polynomial approximation: Theory and Algorithms Borislav Karaivanov We study nonlinear n-term approximation in Lp(R) (0 < p < ∞) from Courant elements or (discontinuous) piecewise polynomials generated by multilevel nested triangulations of R which allow arbitrarily sharp angles. To characterize the rate of approximation we introduce and develop three families of smoothness ...
متن کاملMultivariate n-term rational and piecewise polynomial approximation
We study nonlinear approximation in Lp(R) (0 < p < ∞, d > 1) from (a) n-term rational functions, and (b) piecewise polynomials generated by different anisotropic dyadic partitions of Rd. To characterize the rates of each such piecewise polynomial approximation we introduce a family of smoothness spaces (B-spaces) which can be viewed as an anisotropic variation of Besov spaces. We use the B-spac...
متن کاملContinuous Piecewise Linear Approximation of BV Function
Nonlinear approximation is widely used in signal processing. Real-life signals can be modeled as functions of bounded variation. Thus the variable knot of approximating function could be selfadaptively chosen by balancing the total variation of the target function. In this paper, we adopt continuous piecewise linear approximation instead of the existing piecewise constants approximation. The re...
متن کاملAlgorithms for Nonlinear Piecewise Polynomial Approximation: Theoretical Aspects
In this article algorithms are developed for nonlinear n-term Courant element approximation of functions in Lp (0 < p ≤ ∞) on bounded polygonal domains in R2. Redundant collections of Courant elements, which are generated by multilevel nested triangulations allowing arbitrarily sharp angles, are investigated. Scalable algorithms are derived for nonlinear approximation which both capture the rat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Approximation Theory
سال: 2017
ISSN: 0021-9045
DOI: 10.1016/j.jat.2017.03.002